Genetic Algorithm Based Generator Scheduling-A Review

نویسندگان

  • Syed Basit
  • Ali Bukhari
  • Aftab Ahmad
  • Syed Auon Raza
  • Atta Ul Munim Zaki
چکیده

Generator Scheduling (GS) problemis a non-linear, mixed integer, combinatorial and constrained optimization problem. The main objective of generator scheduling is to prepare the most economic startup and shutdown schedule for generators to meet the forecasted load demand and spinning reservefor a scheduled time horizon while satisfying various constraints. GS problemcan be realized as two interlinked optimization problem, the on/off scheduling problem of generators and real power allocation problem. A feasible generators schedule must satisfy various system and plant constraints.Variousoptimization approaches have been developed for generator scheduling problem. Natural evolution based techniques are widelyusedto obtain global optimal solution. Genetic algorithm is one of the evolutionary technique. This paper presents a comprehensive review on genetic algorithm based generator scheduling problemsolution. A surveyof all of research papers up to 2013 on this topic is given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

Staff Scheduling by a Genetic Algorithm

This paper describes a Genetic Algorithms approach to amanpower-scheduling problem arising at a Petrochemical Company. AlthoughGenetic Algorithms have been successfully used for similar problemsin the past, they always had to overcome the limitations of theclassical Genetic Algorithms paradigm in handling the conflict betweenobjectives and constraints. The approach taken here is to use an indir...

متن کامل

Train Scheduling Problem - Phase II: A Simulation Integrated Genetic AlgorithmSystem

In [1] a feasible timetable generator stochastic simulation modeling framework for the train scheduling problem was developed to obtain a train timetable which includes train arrival and departure times at all visited stations and calculated average train travel time for all trains in the system. In this study, the framework is integrated with a genetic algorithm (GA) in order to get an optimal...

متن کامل

A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014